A symbolic approach to quantitative analysis of preemptive real-time systems with non-Markovian temporal parameters
نویسندگان
چکیده
The method of stochastic state classes provides a means for quantitative analysis of a rather wide class of non-Markovian models. As a major and structural limitation, the approach cannot be applied to models encompassing a preemptive policy, which in the practice rules out the mechanism of suspension and resume usually applied in many real-time systems. We overcome here the limitation by proposing an approach that faces the complexity issues introduced by the suspension/resume mechanism in the structure of supports and distributions of remaining times. In particular, these are distributed over a polyhedral support according to a multivariate joint density function with analytic piecewise form over a partition into polyhedral subdomains. The approach resorts to an imprecise analysis that extends distributions over the tightest DBM zones enclosing polyhedral domains, and approximates them with Bernstein Polynomials to obtain a global (non-piecewise) analytic representation. Computational experience is reported to show the different impact of errors due to the approximation of supports and distributions.
منابع مشابه
A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملSynchronization criteria for T-S fuzzy singular complex dynamical networks with Markovian jumping parameters and mixed time-varying delays using pinning control
In this paper, we are discuss about the issue of synchronization for singular complex dynamical networks with Markovian jumping parameters and additive time-varying delays through pinning control by Takagi-Sugeno (T-S) fuzzy theory.The complex dynamical systems consist of m nodes and the systems switch from one mode to another, a Markovian chain with glorious transition probabili...
متن کاملMarkovian Delay Prediction-Based Control of Networked Systems
A new Markov-based method for real time prediction of network transmission time delays is introduced. The method considers a Multi-Layer Perceptron (MLP) neural model for the transmission network, where the number of neurons in the input layer is minimized so that the required calculations are reduced and the method can be implemented in the real-time. For this purpose, the Markov process order...
متن کاملNew Approach to Exponential Stability Analysis and Stabilization for Delayed T-S Fuzzy Markovian Jump Systems
This paper is concerned with delay-dependent exponential stability analysis and stabilization for continuous-time T-S fuzzy Markovian jump systems with mode-dependent time-varying delay. By constructing a novel Lyapunov-Krasovskii functional and utilizing some advanced techniques, less conservative conditions are presented to guarantee the closed-loop system is mean-square exponentially stable....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011